Distributed Bargaining in Dyadic-Exchange Networks
نویسندگان
چکیده
منابع مشابه
Bargaining dynamics in exchange networks
We consider a one-sided assignment market or exchange network with transferable utility and propose a model for the dynamics of bargaining in such a market. Our dynamical model is local, involving iterative updates of ‘offers’ based on estimated best alternative matches, in the spirit of pairwise Nash bargaining. We establish that when a balanced outcome (a generalization of the pairwise Nash b...
متن کاملSocial Exchange Networks with Distant Bargaining
Network bargaining is a natural extension of the classical, 2-player Nash bargaining solution to the network setting. Here one is given an exchange network G connecting a set of players V in which edges correspond to potential contracts between their endpoints. In the standard model, a player may engage in at most one contract, and feasible outcomes therefore correspond to matchings in the unde...
متن کاملA Natural Dynamics for Bargaining on Exchange Networks
Bargaining networks model the behavior of a set of players that need to reach pairwise agreements for making profits. Nash bargaining solutions are special outcomes of such games that are both stable and balanced. Kleinberg and Tardos proved a sharp algorithmic characterization of such outcomes, but left open the problem of how the actual bargaining process converges to them. A partial answer w...
متن کاملA Nash bargaining model for simple exchange networks
Starting from exogenously given negotiation networks, sociological exchange theories explain bilateral divisions of fixed surpluses (e.g., cake, dollar) as consequences of the partners’ structural embeddedness. In accordance with the available experimental evidence, we focus on simple exchange networks and present a formal model for predicting profit splits from such structures. In contrast to ...
متن کاملControlling Information Exchange in Distributed Bayesian Networks
We propose an algorithm that given a problem formulated as a Distributed Bayesian Network, finds a coordination strategy which minimizes the communication costs while achieving the desired confidence level of the global solution. We developed a system based on this algorithm which models the communication decision process for any given problem structure as a Markov Decision Process and use dyna...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2016
ISSN: 2325-5870
DOI: 10.1109/tcns.2015.2476215